Near 1-designs
نویسندگان
چکیده
منابع مشابه
On the coexistence of conference matrices and near resolvable 2-(2k+1, k, k-1) designs
We show that a near resolvable 2-(2k + 1, k, k − 1) design exists if and only if a conference matrix of order 2k+2 does. A known result on conference matrices then allows us to conclude that a near resolvable 2-(2k + 1, k, k − 1) design with even k can only exist if 2k + 1 is the sum of two squares. In particular, neither a near resolvable 2-(21, 10, 9) design nor a near resolvable 2-(33, 16, 1...
متن کاملSimulated annealing for near-optimal dual-channel mi- croarray designs
Dual-channel microarray experiments can be regarded as designs with block-size two. Our aim is to find D-optimal, A-optimal and related L-optimal designs for such experiments. Previous work has focussed on exhaustive search algorithms, which in many practical, large-scale experiments is infeasible. We propose using simulated annealing to search for near-optimal designs. We also consider a sub-c...
متن کاملErgastulum: quickly finding near-optimal storage system designs
The cost of large storage systems is dominated by management costs. Typically, skilled administrators configure storage manually using rules of thumb. However, designing a storage system for a given workload is a difficult task, because there are millions of possible configurations and mappings of data, and because storage system behavior is complex. Ergastulum is a new storage system designer ...
متن کاملThe Existence of Near Generalized Balanced Tournament Designs
In this paper, we complete the existence of near generalized balanced tournament designs (NGBTDs) with block size 3 and 5. As an application, we obtain new classes of optimal constant composition codes.
متن کاملNear-linear constructions of exact unitary 2-designs
A unitary 2-design can be viewed as a quantum analogue of a 2-universal hash function: it is indistinguishable from a truly random unitary by any procedure that queries it twice. We show that exact unitary 2-designs on n qubits can be implemented by quantum circuits consisting of Õ(n) elementary gates in logarithmic depth. This is essentially a quadratic improvement in size (and in width times ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1972
ISSN: 0097-3165
DOI: 10.1016/0097-3165(72)90014-3